Designing an effective climate-policy mix: accounting for instrument synergy

We assess evidence from theoretical-modelling, empirical and experimental studies on how interactions between instruments of climate policy affect overall emissions reduction. Such interactions take the form of negative, zero or positive synergistic effects. The considered instruments comprise performance and technical standards, carbon pricing, adoption subsidies, innovation support, and information provision. Based on the findings, we formulate climate-policy packages that avoid negative and employ positive synergies, and compare their strengths and weaknesses on other criteria. We note that the international context of climate policy has been neglected in assessments of policy mixes, and argue that transparency and harmonization of national policies may be key to a politically feasible path to meet global emission targets. This suggests limiting the complexity of climate-policy packages

Designing an effective climate-policy mix: accounting for instrument synergy

We assess evidence from theoretical-modelling, empirical and experimental studieson how interactions between instruments of climate policy affect overall emissionsreduction. Such interactions take the form of negative, zero or positive synergisticeffects. The considered instruments comprise performance and technical standards,carbon pricing, adoption subsidies, innovation support, and information provision.Based on the findings, we formulate climate-policy packages that avoid negativeand employ positive synergies, and compare their strengths and weaknesses onother criteria. We note that the international context of climate policy has beenneglected in assessments of policy mixes, and argue that transparency andharmonization of national policies may be key to a politically feasible path to meetglobal emissio

Agent‐based modeling to integrate elements from different disciplines for ambitious climate policy

Ambitious climate mitigation policies face social and political resistance. One reason is that existing policies insufficiently capture the diversity of relevant insights from the social sciences about potential policy outcomes. We argue that agent-based models can serve as a powerful tool for integration of elements from different disciplines. Having such a common platform will enable a more complete assessment of climate policies, in terms of criteria like effectiveness, equity and public support

Anonymisation of geographical distance matrices via Lipschitz embedding

BACKGROUND: Anonymisation of spatially referenced data has received increasing attention in recent years. Whereas the research focus has been on the anonymisation of point locations, the disclosure risk arising from the publishing of inter-point distances and corresponding anonymisation methods have not been studied systematically. METHODS: We propose a new anonymisation method for the release of geographical distances between records of a microdata file-for example patients in a medical database. We discuss a data release scheme in which microdata without coordinates and an additional distance matrix between the corresponding rows of the microdata set are released. In contrast to most other approaches this method preserves small distances better than larger distances. The distances are modified by a variant of Lipschitz embedding. RESULTS: The effects of the embedding parameters on the risk of data disclosure are evaluated by linkage experiments using simulated data. The results indicate small disclosure risks for appropriate embedding parameters. CONCLUSION: The proposed method is useful if published distance information might be misused for the re-identification of records. The method can be used for publishing scientific-use-files and as an additional tool for record-linkage studies

A Measure of the Promiscuity of Proteins and Characteristics of Residues in the Vicinity of the Catalytic Site That Regulate Promiscuity

Promiscuity, the basis for the evolution of new functions through ‘tinkering’ of residues in the vicinity of the catalytic site, is yet to be quantitatively defined. We present a computational method Promiscuity Indices Estimator (PROMISE) - based on signatures derived from the spatial and electrostatic properties of the catalytic residues, to estimate the promiscuity (PromIndex) of proteins with known active site residues and 3D structure. PromIndex reflects the number of different active site signatures that have congruent matches in close proximity of its native catalytic site, the quality of the matches and difference in the enzymatic activity. Promiscuity in proteins is observed to follow a lognormal distribution (μ = 0.28, σ = 1.1 reduced chi-square = 3.0E-5). The PROMISE predicted promiscuous functions in any protein can serve as the starting point for directed evolution experiments. PROMISE ranks carboxypeptidase A and ribonuclease A amongst the more promiscuous proteins. We have also investigated the properties of the residues in the vicinity of the catalytic site that regulates its promiscuity. Linear regression establishes a weak correlation (R2∼0.1) between certain properties of the residues (charge, polar, etc) in the neighborhood of the catalytic residues and PromIndex. A stronger relationship states that most proteins with high promiscuity have high percentages of charged and polar residues within a radius of 3 Å of the catalytic site, which is validated using one-tailed hypothesis tests (P-values∼0.05). Since it is known that these characteristics are key factors in catalysis, their relationship with the promiscuity index cross validates the methodology of PROMISE

Certifying Solvers for Clique and Maximum Common (Connected) Subgraph Problems

An algorithm is said to be certifying if it outputs, together with a solution to the problem it solves, a proof that this solution is correct. We explain how state of the art maximum clique, maximum weighted clique, maximal clique enumeration and maximum common (connected) induced subgraph algorithms can be turned into certifying solvers by using pseudo-Boolean models and cutting planes proofs, and demonstrate that this approach can also handle reductions between problems. The generality of our results suggests that this method is ready for widespread adoption in solvers for combinatorial graph problems